Signed Euler–Mahonian identities

نویسندگان

چکیده

A relationship between signed Eulerian polynomials and the classical on Sn was given by Désarménien Foata in 1992, a refined version, called Euler–Mahonian identity, together with bijective proof proposed Wachs same year. By generalizing this bijection, paper we extend above results to Coxeter groups of types Bn, Dn, complex reflection group G(r,1,n), where ‘sign’ is taken be any one-dimensional character. Some obtained identities can further restricted some particular set permutations. We also derive new interesting sign-balance for Bn Dn.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MacMahon-type Identities for Signed Even Permutations

MacMahon’s classic theorem states that the length and major index statistics are equidistributed on the symmetric group Sn. By defining natural analogues or generalizations of those statistics, similar equidistribution results have been obtained for the alternating group An by Regev and Roichman, for the hyperoctahedral group Bn by Adin, Brenti and Roichman, and for the group of even-signed per...

متن کامل

Binding Identities and Attributes using Digitally Signed Certificates

A certificate is digitally signed by a certificate authority (CA) to confirm that the information in the certificate is valid and belongs to the subject. Certificate users can verify the integrity and validity of a certificate by checking the issuing CA’s digital signature in the certificate and, if necessary, chasing certificate chain and revocation lists. Usually, we use certificates to provi...

متن کامل

Signed Degree Sequences in Signed Bipartite Graphs

A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...

متن کامل

Signed Involutions Avoiding 2-letter Signed Patterns

Let In be the class of all signed involutions in the hyperoctahedral group Bn and let In(T ) be the set of involutions in In which avoid a set T of signed patterns. In this paper, we complete a further case of the program initiated by Simion and Schmidt [6] by enumerating In(T ) for all signed permutations T ⊆ B2.

متن کامل

Signed degree sequences in signed multipartite graphs

A signed k-partite graph (signed multipartite graph) is a k-partite graph in which each edge is assigned a positive or a negative sign. If G(V1, V2, · · · , Vk) is a signed k-partite graph with Vi = {vi1, vi2, · · · , vini}, 1 ≤ i ≤ k, the signed degree of vij is sdeg(vij) = dij = d + ij − d − ij , where 1 ≤ i ≤ k, 1 ≤ j ≤ ni and d + ij(d − ij) is the number of positive (negative) edges inciden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2021

ISSN: ['1095-9971', '0195-6698']

DOI: https://doi.org/10.1016/j.ejc.2020.103209